Linear phase transition in random linear constraint satisfaction problems
نویسندگان
چکیده
منابع مشابه
Linear Phase Transition in Random Linear Constraint Satisfaction Problem
Our model is a generalized linear programming relaxation of a much studied random K-SAT problem. Specifically, a set of linear constraints C on K variables is fixed. From a pool of n variables, K variables are chosen uniformly at random and a constraint is chosen from C also uniformly at random. This procedure is repeated m times independently. We ask the following question: is the resulting li...
متن کاملPhase transition behaviour in constraint satisfaction problems
Many problems in artificial intelligence and computer science can be formulated as constraint satisfaction problems (CSPs). A CSP consists of a set of variables among which a set of constraints are imposed, with a solution corresponding to an assignment for every variable such that no constraints are violated. Most forms of CSP are NP-complete. Recent research has shown that the CSP exhibits a ...
متن کاملRandom Constraint Satisfaction Problems
Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. If there are m constraints over n variables there is typically a large range of densities r = m/n where solutions are known to exist with probability close to one due to non-constructive arguments. However, no algorithms are known to find solutions efficiently with a non-vanishing probability at e...
متن کاملPhase Transition in Finding Multiple Solutions in Constraint Satisfaction Problems
The study of phase transitions in constraint satisfaction problems has attracted much attention recently. Most of the research so far attempts to locate the phase transition for constraint satisfaction problems in which single solution is required. Smith notes that the phase transition is only an interesting event if just one solution is required. Our study reveals that a phase transition also ...
متن کاملThe Phase Transition in Distributed Constraint Satisfaction Problems: Fist Results
We examine the behavior of a distributed constraint satisfaction algorithm. More specifically, we measured the communication and computation costs of a distributed constraint satisfaction algorithm when varying the numbers of intra-agent constraints (constraints which are defined over variables of one agent) and inter-agent constraints (constraints which are defined over variables of multiple a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability Theory and Related Fields
سال: 2004
ISSN: 0178-8051,1432-2064
DOI: 10.1007/s00440-004-0345-z